Apéry sets of shifted numerical monoids
نویسندگان
چکیده
منابع مشابه
Shifts of generators and delta sets of numerical monoids
Let S be a numerical monoid with minimal generating set 〈n1, . . . , nt〉. For m ∈ S, if m = Pt i=1 xini, then Pt i=1 xi is called a factorization length of m. We denote by L(m) = {m1, . . . , mk} (where mi < mi+1 for each 1 ≤ i < k) the set of all possible factorization lengths of m. The Delta set of m is defined by ∆(m) = {mi+1 − mi | 1 ≤ i < k } and the Delta set of S by ∆(S) = ∪m∈S∆(m). In t...
متن کاملDelta Sets of Numerical Monoids Are Eventually Periodic
Let M be a numerical monoid (i.e., an additive submonoid of N0) with minimal generating set 〈n1, . . . , nt〉. For m ∈ M , if m = Pt i=1 xini, then Pt i=1 xi is called a factorization length of m. We denote by L(m) = {m1, . . . , mk} (where mi < mi+1 for each 1 ≤ i < k) the set of all possible factorization lengths of m. The Delta set of m is defined by ∆(m) = {mi+1 −mi | 1 ≤ i < k } and the Del...
متن کاملDelta Sets of Numerical Monoids Using Non-minimal Sets of Generators
Several recent papers have studied the structure of the delta set of a numerical monoid. We continue this work with the assumption that the generating set S chosen for the numerical monoid M is not necessarily minimal. We show that for certain choices of S, the resulting delta set can be made (in terms of cardinality) arbitrarily large or small. We close with a close analysis of the case where ...
متن کاملIntersections of Shifted Sets
We consider shifts of a set A ⊆ N by elements from another set B ⊆ N, and prove intersection properties according to the relative asymptotic size of A and B. A consequence of our main theorem is the following: If A = {an} is such that an = o(n k/k−1), then the k-recurrence set Rk(A) = {x | |A∩ (A+ x)| > k} contains the distance sets of some arbitrarily large finite sets.
متن کاملNumerical properties of shifted tridiagonal
In this paper, we consider shifted tridiagonal matrices. We prove that the standard algorithm to compute the LU factorization in this situation is mixed forward-backward stable and, therefore, componentwise forward stable. Moreover, we give a formula to compute the corresponding condition number in O(n) flops. Mathematics Subject Classification (2000). 65F35, 65F50, 15A12, 15A23, 65G50.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2018
ISSN: 0196-8858
DOI: 10.1016/j.aam.2018.01.005